LiveCG: a Framework for Interactive Visualization of Algorithms from Computational Geometry

نویسنده

  • Sebastian Kürten
چکیده

The field of Computational Geometry is devoted to geometric problems and to finding efficient algorithms for solving them. Given that the problems of the field are typically concerned with geometric objects and manipulations of such, it appears natural to visualize the geometric context of a problem when studying it. This thesis describes the design and implementation of a framework for the visualization of algorithms and data structures from computational geometry. This framework can assist scientists and students in creating useful visualizations with reduced effort by profiting from the ready to use components of the system. It also serves as a tool for people interested in learning about specific algorithms as a good visualization can be a helpful instrument in understanding complex problems. For some basic algorithms of the field, animated visualizations have been created that will be presented as well.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Visualization of Geometric Spanner Algorithms

It is easier to understand an algorithm when it can be seen in interactive mode. The current study implemented four algorithms to construct geometric spanners; the path-greedy, gap-greedy, Θ-graph and Yao-graph algorithms. The data structure visualization framework (http://www. cs.usfca.edu/~galles/visualization/) developed by David Galles was used. Two features were added to allow its use in s...

متن کامل

Feasibility of detecting and localizing radioactive source using image processing and computational geometry algorithms

We consider the problem of finding the localization of radioactive source by using data from a digital camera. In other words, the camera could help us to detect the direction of radioactive rays radiation. Therefore, the outcome could be used to command a robot to move toward the true direction to achieve the source. The process of camera data is performed by using image processing and computa...

متن کامل

Interactive Geometric Algorithm Visualization in a Browser

We present an online, interactive tool for writing and presenting interactive geometry demos suitable for classroom demonstrations. Code for the demonstrations is written in JavaScript using p5.js, a JavaScript library based on Processing. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems – Geometrical problems and computations

متن کامل

FastMesh: Efficient View-dependent Meshing

In this paper we present an optimized view-dependent meshing framework for adaptive and continuous level-of-detail (LOD) rendering in real-time. Multiresolution triangle mesh representations are an important tool for adapting triangle mesh complexity in real-time rendering environments. Ideally for interactive visualization, a triangle mesh is simplified to the maximal tolerated perceptual erro...

متن کامل

Parleda: a Library for Parallel Processing in Computational Geometry Applications

ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014